<HTML><HEAD><TITLE>locate(+LocateVars, +SquashVars, ++Precision, ++LinLog)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(ic)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>locate(+LocateVars, +SquashVars, ++Precision, ++LinLog)</H1>
Locate solution intervals for LocateVars, interleaving search with squashing.
<DL>
<DT><EM>LocateVars</EM></DT>
<DD>Collection (a la collection_to_list/2) of variables
</DD>
<DT><EM>SquashVars</EM></DT>
<DD>Collection of variables
</DD>
<DT><EM>Precision</EM></DT>
<DD>Minimum required precision (float)
</DD>
<DT><EM>LinLog</EM></DT>
<DD>Domain splitting method (lin or log)
</DD>
</DL>
<H2>Description</H2>
<P>
   A variant of locate/2,3 with interleaved squashing.  The squash algorithm
   is applied once to the SquashVars initially, and then again after each
   splitting step (i.e. each time one of the LocateVars has been split
   nondeterministically during the search).  A variable may occur in both
   LocateVars and SquashVars.</P><P>

   The LinLog parameter guides the way domains are split.  If it is set to
   <TT>lin</TT> then the split is linear (i.e. the arithmetic mean of the bounds is
   used).  If it is set to <TT>log</TT>, the split is logarithmic (i.e. the geometric
   mean of the bounds is used).  Note that if <TT>log</TT> is used, there will be
   roughly the same number of representable floating point numbers on either
   side of the split, due to the logarithmic distribution of these numbers.</P>

<H2>See Also</H2>
<A HREF="../../lib/ic/locate-2.html">locate / 2</A>, <A HREF="../../lib/ic/locate-3.html">locate / 3</A>, <A HREF="../../lib/ic/squash-3.html">squash / 3</A>, <A HREF="../../lib/lists/collection_to_list-2.html">lists : collection_to_list / 2</A>
</BODY></HTML>
